Average Performance Analysis for Thresholding
نویسندگان
چکیده
منابع مشابه
Average Performance Analysis
The purpose of measures in algorithm theory is to distinguish between “good” and “bad” algorithms. The main drawback of classical worst-case analysis is that one single “bad” instance decides the performance of an algorithm. Moreover, worst-case instances are often quite artificial and often do not represent a “realistic” or “typical” instance of a problem. In this thesis, we are concerned with...
متن کاملAverage Performance Analysis
The purpose of measures in algorithm theory is to distinguish between “good” and “bad” algorithms. The main drawback of classical worst-case analysis is that one single “bad” instance decides the performance of an algorithm. Moreover, worst-case instances are often quite artificial and often do not represent a “realistic” or “typical” instance of a problem. In this thesis, we are concerned with...
متن کاملAverage case analysis of multichannel sparse approximations using p-thresholding
This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter results in much weaker conditions on the dictionary. Numerical simulations confirm our theoretical findings and show that p-thresholding is a...
متن کاملPerformance analysis for a class of iterative image thresholding algorithms
A performance analysis procedure that analyses the properties of a class of iterative image thresholding algorithms is described. The image under consideration is modeled as consisting of two maximum-entropy primary images, each of which has a quasi-Gaussian probability density function. Three iterative thresholding algorithms identified to share a common iteration architecture are employed for...
متن کاملSparsity according to Prony, average performance analysis
Finding the sparse representation of a signal in an overcomplete dictionary has attracted a lot of attention over the past years. Traditional approaches such as Basis Pursuit are based on relaxing a nonconvex `0-minimization problem [1]–[3]. In [4], a new polynomial complexity algorithm, ProSparse, is presented. ProSparse solves the sparse representation problem when the dictionary is the union...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2007
ISSN: 1070-9908
DOI: 10.1109/lsp.2007.903248